ffPS Overseas Tours

Minimum-link watchman tours

We consider the problem of computing a watchman route in a polygon with holes. We show that the problem of finding a minimum-link watchman route is NP-complete, even if the holes are all convex. The proof is based on showing that the related problem of finding a minimum-link tour on a set of points in the plane is NP-complete. We provide a provably good approximation algorithm that achieves an ...

Figurative Tours and Braids

We start with a rectangular grid of points, and we connect pairs of points to form either a tour (a Hamiltonian cycle) or a braid (a collection of disjoint paths that start in the top row and end on the bottom). In each case, our goal is to design a graph that will closely resemble a grayscale target image when viewed from a distance. From up close, the graph will look like an abstract pattern....

Testing overseas doctors.

Good triangulations yield good tours

Consider the following heuristic for planar Euclidean instances of the traveling salesman problem (TSP): select a subset of the edges which induces a planar graph, and solve either the TSP or its graphical relaxation on that graph. In this paper, we give several motivations for considering this heuristic, along with extensive computational results. It turns out that the Delaunay and greedy tria...

Virtual tours for museum exhibits

This paper outlines the technological requirements and the steps necessary to create a virtual tour for a virtual museum exhibit using QR Codes. This system was developed for the Gilcrease Museum in Tulsa, Oklahoma and was tested in two separate exhibits. The components of virtualization include: images of each object for visualization; object labels and metadata about the objects in the exhibi...